用MAXScript脚本语言生成分形图形

介绍了分形生成技术的原理与性质、MAXScript脚本语言的特点及功能，详细叙述了用MAXScript脚本语言生成分形图形的设计思想和实现方法。针对分形几何的特点，以具有严格自相似性的分形树为例，通过解释源代码、描述程序运行过程和结果，以及对生成的图片用3DSMAX进行再处理，分析了在3DSMAX环境中用MAXScript脚本语言生成分形图形这一新方法的优点和不足。     

基于改进PSO算法的结构损伤检测

结构的损伤检测常转化为求解约束优化问题,针对粒子群算法容易出现早熟问题,增大算法后期的粒子位置的改变量,从而增加粒子位置的差异,因而能够增强其在求解约束优化问题时抵抗局部极小的能力。两层刚架单损伤和多损伤识别的数值结果和收敛曲线表明了改进后的粒子群算法优于传统的带惯性因子的粒子群算法。三层框架结构的4种损伤工况的试验研究进一步说明了该算法应用于结构损伤检测领域的有效性。     

Eigensolution of specially structured matrices with hyper‐symmetry

Recently, four canonical forms have been developed and applied to the dynamics and stability analysis of symmetric frames. In this paper, hyper‐symmetric matrices and specially structured matrices are defined and efficient methods are proposed for the eigensolution of such matrices. Applications are extended to hyper‐graphs and specially structured graphs. Simple methods are developed for calculating the eigenvalues of the Laplacian matrices of such graphs. The developments presented in this paper can also be considered as generalization of Form II and Form III symmetry, previously defined by the authors. Copyright © 2006 John Wiley & Sons, Ltd.     

防患于未然:水坝潜在溃决模式探究与分析

本文简介三种常见水坝的一些具有代表性的潜在溃决模式和导致这些模式发生的根本原因（即所谓的风险因素和可能的理由），俗云：“不经一事，不长一智”，冀望从过去的溃坝案例中吸取宝贵的教训，以正视每一个可能影响水坝安全的问题。本文略述近期发展的蓄水坝潜在溃决模式分析方法的步骤，借着制度面的革新，透过团队合作方式，以确认、判断可能存在的潜在溃决模式及其发生的相对可能性，采取必要的补救措施。     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.     

牙哈采油树腐蚀检查分析及对策

介绍塔里木牙哈凝析气田高温高压井口采油树腐蚀的现象，腐蚀机理及采取的措施，对其他油田采油树腐蚀的防治起到指导借鉴作用。     

Evaluation codes at singular points of algebraic differential equations

We use the special geometry of singular points of algebraic differential equations on the affine plane over finite fields to study the main features and parameters of error correcting codes giving by evaluating functions at sets of singular points. In particular, one gets new methods to construct codes with designed minimum distance. This work was partially supported by MCyT BFM2001-2251.     

A Standard Model-Theoretic Approach to Operational Semantics of Recursive Programs

In this paper we try to introduce a new approach to operational semantics of recursive programsby using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu ofmodelling partial functions by introducing undefined values in a traditional approach,we shall define apriority derivation tree for every term,and by respecting the rule“attacking the subterm of thehighest priority first”we define transition relations,computation sequences etc.directly based on astandard interpretation which includes no undefined value in its domain.Finally,we prove that ournew approach generates the same operational semantics as the traditional one.It is also pointed outthat we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semanticsof recursive programs cannot be built based on predicate logic.     

Genetic algorithms for symbolic clustering

This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical information. A new type of representation for chromosome structure is presented here along with a new method for mutation. The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the clusters obtained is examined.